Erdős and Rényi Conjecture
نویسندگان
چکیده
منابع مشابه
Erdos and Rényi Conjecture
Affirming a conjecture of Erdös and Rényi we prove that for any (real number) c1 > 0 for some c2 > 0, if a graph G has no c1(log n) nodes on which the graph is complete or edgeless (i.e. G exemplifies |G| 9 (c1 log n)22) then G has at least 22 non-isomorphic (induced) subgraphs. Latest Revision 97/Aug/14 I thank Alice Leonhardt for the beautiful typing Typeset by AMS-TEX 1 6 2 7 r e v i s i o n...
متن کاملErdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs
Given a finite group G by its multiplication table as input, we give a deterministic polynomial-time construction of a directed Cayley graph on G with O(log |G|) generators, which has a rapid mixing property and a constant spectral expansion. We prove a similar result in the undirected case, and give a new deterministic polynomialtime construction of an expanding Cayley graph with O(log |G|) ge...
متن کاملAdjusting a conjecture of Erdős
We investigate a conjecture of Paul Erdős, the last unsolved problem among those proposed in his landmark paper [2]. The conjecture states that there exists an absolute constant C > 0 such that, if v1, . . . , vn are unit vectors in a Hilbert space, then at least C 2 n of all ∈ {−1, 1} are such that | Pn i=1 ivi |≤ 1. We disprove the conjecture. For Hilbert spaces of dimension d > 2, the counte...
متن کاملErdős - Rényi Random Graphs + Forest Fires = Self - Organized Criticality
We modify the usual Erd˝ os-Rényi random graph evolution by letting connected clusters 'burn down' (i.e. fall apart to disconnected single sites) due to a Poisson flow of lightnings. In a range of the intensity of rate of lightnings the system sticks to a permanent critical state. The authors thank the anonymous referee for thoroughly reading the manuscript. Her/his comments and suggestions hel...
متن کاملExplosive Percolation in Erdős-Rényi-Like Random Graph Processes
The evolution of the largest component has been studied intensely in a variety of random graph processes, starting in 1960 with the Erdős-Rényi process (ER). It is well known that this process undergoes a phase transition at n/2 edges when, asymptotically almost surely, a linear-sized component appears. Moreover, this phase transition is continuous, i.e., in the limit the function f(c) denoting...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1998
ISSN: 0097-3165
DOI: 10.1006/jcta.1997.2845